An Efficient Search Mechanism for Dynamic Path Selection
نویسندگان
چکیده
منابع مشابه
An Efficient Dynamic Mechanism an Efficient Dynamic Mechanism
The copyright to this Article is held by the Econometric Society. It may be downloaded, printed and reproduced only for educational or research purposes, including use in course packs. No downloading or copying may be done for any commercial purpose without the explicit permission of the Econometric Society. For such commercial purposes contact the Office of the Econometric Society (contact inf...
متن کاملOn Choosing an Efficient Service Selection Mechanism in Dynamic Environments
Consumers use service selection mechanisms to decide on a service provider to interact with. Although there are various service selection mechanisms, each mechanism has different strengths and weaknesses for different settings. In this paper, we propose a novel approach for consumers to learn how to choose the most useful service selection mechanism among different alternatives in dynamic envir...
متن کاملAn Efficient Dynamic Mechanism
This paper constructs an efficient, budget-balanced, Bayesian incentive-compatible mechanism for a general dynamic environment with quasilinear payoffs in which agents observe private information and decisions are made over countably many periods. First, under the assumption of “private values” (other agents’ private information does not directly affect an agent’s payoffs), we construct an effi...
متن کاملAN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Digital Contents Society
سال: 2012
ISSN: 1598-2009
DOI: 10.9728/dcs.2012.13.3.451